A Specialised Binary Constraint for the Stable Marriage Problem
نویسندگان
چکیده
We present a specialised binary constraint for the stable marriage problem. This constraint acts between a pair of integer variables where the domains of those variables represent preferences. Our constraint enforces stability and disallows bigamy. For a stable marriage instance with n men and women we require n of these constraints, and the complexity of enforcing arc-consistency is O(n). Although this is non-optimal, empirical evidence suggests that in practical terms our encoding significantly outperforms the optimal encoding given in [7] in both space and time.
منابع مشابه
A Specialised Binary Constraint for the Stable Marriage
Gent and Prosser proposed the first constraint model for the Stable Marriage problem with Ties and Incomplete preference lists (SMTI). Their model was based upon the simple Stable Marriage (SM) model proposed by Gent et al, in which for each man woman pair a constraint is posted consisting of a set of no good pairs of values. Prosser and Unsworth proposed a specialised binary constraint for SM ...
متن کاملA specialised constraint approach for stable matching problems
Constraint programming is a generalised framework designed to solve combinatorial problems. This framework is made up of a set of predefined independent components and generalised algorithms. This is a very versatile structure which allows for a variety of rich combinatorial problems to be represented and solved relatively easily. Stable matching problems consist of a set of participants wishin...
متن کاملSpecialised Constraints for Stable Matching Problems
The stable marriage problem (SM) and the Hospital / Residents problem (HR) are both stable matching problems. They consist of two sets of objects that need to be matched to each other; in SM men to women, and in HR residents to hospitals. Each set of objects expresses a ranked preference for the objects in the other set, in the form of a preference list. The problem is then to find a matching o...
متن کاملAn n-ary Constraint for the Stable Marriage Problem
We present an n-ary constraint for the stable marriage problem. This constraint acts between two sets of integer variables where the domains of those variables represent preferences. Our constraint enforces stability and disallows bigamy. For a stable marriage instance with n men and n women we require only one of these constraints, and the complexity of enforcing arc-consistency is O(n) which ...
متن کاملStable Roommates and Constraint Programming A first stab
In the stable roommates problem we have n agents, where each agent ranks all n − 1 other agents. The problem is then to match agents into pairs such that no two agents prefer each other to their matched partners. A remarkably simple constraint encoding is presented that uses O(n) binary constraints, and in which arc-consistency (the phase-1 table) is established in O(n) time. This leads us to a...
متن کامل